On the Uniform Convexity Of

نویسنده

  • HARALD HANCHE-OLSEN
چکیده

The standard proof of the uniform convexity of L using Clarkson’s [1] or Hanner’s [2] inequalities (see also [4]) is rarely taught in functional analysis classes, in part (the author imagines) because the proofs of those inequalities are quite non-intuitive and unwieldy. We present here a direct proof, cheerfully sacrificing the optimal bounds – for which, see [2, 4]. It fits quite nicely in with the standard proof of Hölder’s inequality using Young’s inequality Rexy ≤ |x|/p + |y|/q. Recall that equality holds precisely when xy ≥ 0 and |x| = |y|; and that the condition for equality in Hölder’s inequality follows from this. The idea of the present proof is to exploit a lower bound for the difference in Young’s inequality.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ball Versus Distance Convexity of Metric Spaces

We consider two different notions of convexity of metric spaces, namely (strict/uniform) ball convexity and (strict/uniform) distance convexity. Our main theorem states that (strict/uniform) distance convexity is preserved under a fairly general product construction, whereas we provide an example which shows that the same does not hold for (strict/uniform) ball convexity, not even when consider...

متن کامل

Testing Convexity of Figures Under the Uniform Distribution

We consider the following basic geometric problem: Given ∈ (0, 1/2), a 2-dimensional figure that consists of a black object and a white background is -far from convex if it differs in at least an fraction of the area from every figure where the black object is convex. How many uniform and independent samples from a figure that is -far from convex are needed to detect a violation of convexity wi...

متن کامل

Convexity and Geodesic Metric Spaces

In this paper, we first present a preliminary study on metric segments and geodesics in metric spaces. Then we recall the concept of d-convexity of sets and functions in the sense of Menger and study some properties of d-convex sets and d-convex functions as well as extreme points and faces of d-convex sets in normed spaces. Finally we study the continuity of d-convex functions in geodesic metr...

متن کامل

A full NT-step O(n) infeasible interior-point method for Cartesian P_*(k) –HLCP over symmetric cones using exponential convexity

In this paper, by using the exponential convexity property of a barrier function, we propose an infeasible interior-point method for Cartesian P_*(k) horizontal linear complementarity problem over symmetric cones. The method uses Nesterov and Todd full steps, and we prove that the proposed algorithm is well define. The iteration bound coincides with the currently best iteration bound for the Ca...

متن کامل

Some Results on Convexity and Concavity of Multivariate Copulas

This paper provides some results on different types of convexity and concavity in the class of multivariate copulas. We also study their properties and provide several examples to illustrate our results.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005